On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The atomic decomposition of strongly connected graphs

We define and study a new canonical decomposition of strongly connected graphs that we call the atomic decomposition. We can construct it in linear time from the decomposition in 3-connected components of the considered graph. In a companion article, we use it to characterize, up to homeomorphism, all closed curves in the plane having a given Gauss word.

متن کامل

O(m logn) Split Decomposition of Strongly Connected Graphs

In the early 1980’s, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the general case has been O(n). We give an O(m log n) bound.

متن کامل

A note on minimally 3-connected graphs

If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E (G)| ≥ 2 |C| − 2.

متن کامل

Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

This article presents parallel algorithms for component decomposition of graph structures on general purpose graphics processing units (GPUs). In particular, we consider the problem of decomposing sparse graphs into strongly connected components, and decomposing graphs induced by stochastic games (such as Markov decision processes) into maximal end components. These problems are key ingredients...

متن کامل

On strongly connected orientations of graphs

We consider finite, loopless graphs or digraphs, without multiple edges or arcs (with no pairs of opposite arcs). Let G = (V,E) be a graph. A digraph D = (V,A) is an orientation of G if A is created from E by replacing every edge of E by an arc in one direction. Let nd denote the number of vertices with the degree d in G. By the degree pair of a vertex v ∈ V in D the ordered pair [outdegree(v),...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1980

ISSN: 0012-365X

DOI: 10.1016/0012-365x(80)90176-4